Instruction Pipeline Efficient Mechanism with Maximum Hit Ratio

نویسندگان

  • Shahnawaz Talpur
  • Yizhuo Wang
  • Shahnawaz Farhan Khahro
  • XiaoJun Wang
  • Xu Chen
  • Feng Shi
چکیده

To achieve highest performance in rapidly growing advancement in multi-core technology, there is need to minimize the large gap between faster processor speed and memory. It becomes more critical issue when branch occurs with penalty of cache miss. Many researchers proposed different branch prediction, instruction perfecting methods and algorithms but the CPU pipeline performance couldn’t be the maximal. A prototype model has been designed in this paper which has no prediction for branch and no chance of CPU core to be idle. Analysisis carried out on the benchmarks suite and Transactional Slice (TS) has been proposed in contrast with traditional delay slot and dynamic prediction fetch branch. In proposed mechanism hit rate will be maximal. Pin Tool is used to analyze the Transactional Slice with SPEC 2006 benchmark.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Effect of Cache on the Performance of a Multi-Threaded Pipelined RISC Processor

This paper examines the effects of multithreaded pipelining on the CPI (cycles per instruction) of a RISC processor. The desired CPI in a conventional (single-threaded) RISC processor is one instruction per cycle. However, the CPI is typically more than one because of data hazards, control hazards, and resource hazards in the pipeline. A multi-threaded processor performs a context switch betwee...

متن کامل

In uence of Variable Time Operations in StaticInstruction

Instruction Scheduling is the task of deciding what instruction will be executed at which unit of time. The objective is to extract maximum instruction level parallelism for the code. Compilers designed for VLIW and EPIC architectures do static instruction scheduling in a back-end pass. This pass, known as scheduler, needs to have full knowledge of the execution time of each instruction. But me...

متن کامل

A Theory for Software-Hardware Co-Scheduling for ASIPs and Embedded Processors

Exploiting instruction-level parallelism (ILP) is extremely important for achieving high performance in application specific instruction set processors (ASIPs) and embedded processors. Existing techniques deal with either scheduling hardware pipelines to obtain higher throughput or software pipeline — an instruction scheduling technique for iterative computation — loops for exploiting greater I...

متن کامل

Quantifying the Impacts of Disabling Speculation and Relaxing the Scheduling Loop in Multithreaded Processors By

Traditional architectural approaches for increasing microprocessor performance rely on the use of large, complex, highly-speculative out-of-order cores to extract InstructionLevel Parallelism (ILP) from single-threaded applications. In order to realize high performance, these designs employ a myriad of speculative techniques, ranging from branch prediction to load-latency prediction and memory-...

متن کامل

An Accurate and Energy-Efficient Way Determination Technique for Instruction Caches by Using Early Tag Matching

Energy consumption has become an important design consideration in modern processors. Therefore, microarchitects should consider energy consumption, together with performance, when designing the cache architecture, since it is a major power consumer in a processor. This paper proposes an accurate and energy-efficient way determination (instead of prediction) technique for reducing energy consum...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013